Distribution of Additive Functions with Respect to Numeration Systems on Regular Languages

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Additive Functions with Respect to Numeration Systems on Regular Languages

Additive numeration systems and the corresponding additive arithmetic functions have been studied from various points of view since the seminal papers of H. Delange [4, 5], where such functions were investigated for the usual q-adic numeration system. Later more exotic systems of numeration, such as general linear numeration systems [13, 14], especially such systems defined by linear recurring ...

متن کامل

Distribution properties of sequences generated by Q-additive functions with respect to Cantor representation of integers

In analogy to ordinary q-additive functions based on q-adic expansions one may use Cantor expansions with a Cantor base Q to define (strongly) Q-additive functions. This paper deals with distribution properties of multi-dimensional sequences which are generated by such Q-additive functions. If in each component we have the same Cantor base Q, then we show that uniform distribution already impli...

متن کامل

a comparison of teachers and supervisors, with respect to teacher efficacy and reflection

supervisors play an undeniable role in training teachers, before starting their professional experience by preparing them, at the initial years of their teaching by checking their work within the proper framework, and later on during their teaching by assessing their progress. but surprisingly, exploring their attributes, professional demands, and qualifications has remained a neglected theme i...

15 صفحه اول

Numeration Systems, Linear Recurrences, and Regular Sets

A numeration system based on a strictly increasing sequence of positive integers u0 = 1, u1, u2, . . . expresses a non-negative integer n as a sum n = ∑i j=0 ajuj . In this case we say the string aiai−1 · · · a1a0 is a representation for n. If gcd(u0, u1, . . .) = g, then every sufficiently large multiple of g has some representation. If the lexicographic ordering on the representations is the ...

متن کامل

Numeration Systems on Bounded Languages and Multiplication by a Constant

NUMERATION SYSTEMS ON BOUNDED LANGUAGES AND MULTIPLICATION BY A CONSTANT Emilie Charlier Institute of Mathematics, University of Liège, Grande Traverse 12 (B 37), B–4000 Liège, Belgium [email protected] Michel Rigo Institute of Mathematics, University of Liège, Grande Traverse 12 (B 37), B–4000 Liège, Belgium [email protected] Wolfgang Steiner LIAFA, CNRS, Université Paris Diderot – Paris 7, c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theory of Computing Systems

سال: 2006

ISSN: 1432-4350,1433-0490

DOI: 10.1007/s00224-005-1231-5